# 211226

# 查询 n 到 m 间的所有素数
def find_prime_number(n, m):
	if isinstance(n, int) and isinstance(m, int):
		print('start calculating...')
		# 检查
		if m <= 1:
			return 'ERR RANGE'
		if 1 >= n > m:
			return 'ERR START, END'
		
		# 范围内的素数列表
		numbers = list()
		num = n
		while num <= m:
			i = 2
			while i < num:
				if (num % i == 0) and (num != 1):
					break
				else:
					i += 1
			if num == i:
				numbers.append(num)
			num += 1
		return numbers
	else:
		return 'ERR INPUT.'

print(find_prime_number(1, 100))
print('END.')